منابع مشابه
Sound and Complete Typing for lambda-mu
In this paper we define intersection and union type assignment for Parigot's calculus λµ. We show that this notion is complete (i.e. closed under subject-expansion), and show also that it is sound (i.e. closed under subject-reduction). This implies that this notion of intersection-union type assignment is suitable to define a semantics.
متن کاملSound and Complete Typing for λμ
In this paper we define intersection and union type assignment for Parigot’s calculus λμ. We show that this notion is complete (i.e. closed under subject-expansion), and show also that it is sound (i.e. closed under subject-reduction). This implies that this notion of intersection-union type assignment is suitable to define a semantics.
متن کاملLambda and mu-symmetries
Symmetry analysis is a standard and powerful method in the analysis of differential equations, and in the determination of explicit solutions of nonlinear ones. It was remarked by Muriel and Romero [10] (see also the work by Pucci and Saccomandi [14]) that for ODEs the notion of symmetry can be somehow relaxed to that of lambda-symmetry (see below), still retaining the relevant properties for s...
متن کاملSound and Complete Flow Typing with Unions, Intersections and Negations
Flow typing is becoming a popular mechanism for typing existing programs written in untyped languages (e.g. JavaScript, Racket, Groovy). Such systems require intersections for the true-branch of a type test, negations for the false-branch, and unions to capture the flow of information at meet points. Type systems involving unions, intersections and negations require a subtype operator which is ...
متن کاملSuperdeduction in Lambda-Bar-Mu-Mu-Tilde
Superdeduction is a method specially designed to ease the use of first-order theories in predicate logic. The theory is used to enrich the deduction system with new deduction rules in a systematic, correct and complete way. A proof-term language and a cut-elimination reduction already exist for superdeduction, both based on Christian Urban’s work on classical sequent calculus. However the compu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2011
ISSN: 2075-2180
DOI: 10.4204/eptcs.45.3